- minimum/maximum flow
- Техника: минимальный/максимальный расход
Универсальный англо-русский словарь. Академик.ру. 2011.
minimum/maximum flow
Смотреть что такое "minimum/maximum flow" в других словарях:
Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network … Wikipedia
Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also … Wikipedia
Minimum cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Definition Given a flow network ,G(V,E) with source s in V and sink t in V, where edge (u,v) in E has capacity ,c(u,v) … Wikipedia
Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… … Wikipedia
Minimum cut — In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible. Several algorithms exist to find minimum cuts. For a graph G = (V, E), the problem can be… … Wikipedia
Minimum viable population — (MVP) is a lower bound on the population of a species, such that it can survive in the wild. This term is used in the fields of biology, ecology, and conservation biology. More specifically MVP is the smallest possible size at which a biological… … Wikipedia
Maximum sustainable yield — In population ecology and economics, maximum sustainable yield or MSY is, theoretically, the largest yield (or catch) that can be taken from a species stock over an indefinite period. Fundamental to the notion of sustainable harvest, the concept… … Wikipedia
Minimum k-cut — In mathematics, the minimum k cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to k connected components. These edges are referred to as k cut. The goal is to find the… … Wikipedia
Maximum modulus principle — A plot of the modulus of cos(z) (in red) for z in the unit disk centered at the origin (shown in blue). As predicted by the theorem, the maximum of the modulus cannot be inside of the disk (so the highest value on the red surface is somewhere… … Wikipedia
Maximum segment size — The maximum segment size (MSS) is a parameter of the TCP protocol that specifies the largest amount of data, specified in octets, that a computer or communications device can receive in a single TCP segment, and therefore in a single IP datagram … Wikipedia
Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
